input()
a=[*map(int,input().split())]
m=max(a)
r=l=0
for x in a:
if x<m:l=0
else:l+=1;r=max(r,l)
print(r)
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
ios_base::sync_with_stdio(0);
int n;
cin >> n;
int a[n];
int maxi = -1;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (a[i] > maxi)
{
maxi = a[i];
}
}
int length=0;
int p=0,q=0;
for (int i = 0; i < n; i++)
{
if (a[i]==maxi && q==0)
{
q=1;
p=i;
}
else if(a[i]!=maxi && q==1) {
q=0;
length=max(length,i-p);
}
if(i==n-1 && a[i]==maxi && q==1){
length=max(length,i-p+1);
}
}
cout<<length<<endl;
}
841. Keys and Rooms | 152. Maximum Product Subarray |
337. House Robber III | 869. Reordered Power of 2 |
1593C - Save More Mice | 1217. Minimum Cost to Move Chips to The Same Position |
347. Top K Frequent Elements | 1503. Last Moment Before All Ants Fall Out of a Plank |
430. Flatten a Multilevel Doubly Linked List | 1290. Convert Binary Number in a Linked List to Integer |
1525. Number of Good Ways to Split a String | 72. Edit Distance |
563. Binary Tree Tilt | 1306. Jump Game III |
236. Lowest Common Ancestor of a Binary Tree | 790. Domino and Tromino Tiling |
878. Nth Magical Number | 2099. Find Subsequence of Length K With the Largest Sum |
1608A - Find Array | 416. Partition Equal Subset Sum |
1446. Consecutive Characters | 1618A - Polycarp and Sums of Subsequences |
1618B - Missing Bigram | 938. Range Sum of BST |
147. Insertion Sort List | 310. Minimum Height Trees |
2110. Number of Smooth Descent Periods of a Stock | 2109. Adding Spaces to a String |
2108. Find First Palindromic String in the Array | 394. Decode String |